Shellability of Noncrossing Partition Lattices
نویسندگان
چکیده
We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type Dn and those of exceptional type and rank at least three.
منابع مشابه
A Note on Shellability of Hypergraph Arrangements
For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown to have shellable intersection lattices.
متن کاملChains in the Noncrossing Partition Lattice
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification of finite Coxeter groups) using basic facts about noncrossing partitions. We solve these recursions for each finite Coxeter group in the classification. Amon...
متن کاملShellable Nonpure Complexes and Posets. I
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have the same dimension). The usefulness of this level of generality was suggested by certain examples coming from the theory of subspace arrangements. We develop several of the basic properties of the concept of nonpure shellability. Doubly indexed f -vectors and h-vector...
متن کاملEL-Shellability of Generalized Noncrossing Partitions Associated to Well-Generated Complex Reflection Groups
In this article we prove that the poset of m-divisible noncrossing partitions is EL-shellable for every wellgenerated complex reflection group. This was an open problem for type G(d, d, n) and for the exceptional types, for which a proof is given case-by-case. Résumé. Dans cet article nous prouvons que l’ensemble ordonné des partitions non-croisées m-divisibles est ELépluchable (“EL-shellable”)...
متن کاملUndesired Parking Spaces and Contractible Pieces of the Noncrossing Partition Link
There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call the noncrossing partition link because it is the link of an edge in the former. The first author and his coauthors conjectured that various collections of si...
متن کامل